The rate loss in the Wyner-Ziv problem

نویسنده

  • Ram Zamir
چکیده

The rate-distortion function for source coding with side information at the decoder (the \Wyner-Ziv problem") is given in terms of an auxiliary random variable, which forms a Markov chain with the source and the side information. This Markov chain structure, typical to the solution of multiterminal source coding problems, corresponds to a loss in coding rate with respect to the conditional rate-distortion function, i.e., to the case where the encoder is fully informed. We show that for diierence (or balanced) distortion measures, this loss is bounded by a universal constant, which is the minimax capacity of a suitable additive noise channel. Furthermore, in the worst case this loss is equal to the maximin redundancy over the rate distortion function of the additive noise \test" channel. For example, the loss in the Wyner-Ziv problem is less than 0:5 bit per sample in the squared-error distortion case, and it is less than 0:22 bits for a binary source with Hamming-distance. These results have implications also in universal quantization with side information, and in more general multiterminal source coding problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wyner-Ziv Coding of Still Images with Rate Estimation at the Encoder

We develop a Wyner-Ziv still image codec with decoder feedback, based on a Rate Compatible Punctured Turbo (RCPT) code. Within this framework, two methods of pairing source data with side information are compared and found to be similar in performance. The architecture is modified into a Wyner-Ziv image codec with rate estimation at the encoder. The proposed rate estimator is the mean of the tu...

متن کامل

Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss

An l-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graphbased codes. A successive coding scheme is proposed for converting an l-link binary CEO problem to the (2l − 1) single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically ach...

متن کامل

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

Successive Wyner-Ziv Coding Scheme and its Application to the Quadratic Gaussian CEO Problem

We introduce a distributed source coding scheme called successive Wyner-Ziv coding scheme. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The notion of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinem...

متن کامل

Successive refinement based Wyner-Ziv video compression

Wyner-Ziv coding enables low complexity video encoding with the motion estimation procedure shifted to the decoder. However, the accuracy of decoder motion estimation is often low, due to the absence of the input source frame (at the decoder). In this paper, we propose a novel Wyner-Ziv successive refinement approach to improve the motion compensation accuracy and the overall compression effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1996